A Distributed Routing Algorithm for Internet-wide Geocast

Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations

Infrastructure Support for Contention-Based Forwarding

Geocast is an important forwarding method for vehicular networks. One standard of vehicular communication is ETSI ITS-G5 GeoNetworking. One of the forwarding methods for geocast in this standard is Contention Based Forwarding (CBF). CBF is dependent on a favourable vehicle distribution to forward messages over multiple hops. A method to extend the effective range of vehicles is to use road side infrastructure to help forward messages. We propose a slightly modified CBF algorithm for road side infrastructure to enable infrastructure assisted forwarding for geocast messages, without modifying the CBF algorithm in the vehicles. In this paper we show that such a relatively small modification can significantly increase delivery rates while also reducing wireless load and delivery delays.</p

Endogenous Bak inhibitors Mcl-1 and Bcl-xL: differential impact on TRAIL resistance in Bax-deficient carcinoma

Although both Mcl-1 and Bcl-xL keep proapoptotic Bak in check, it is the loss of Mcl-1 that sensitizes cells to death receptor–mediated apoptosis

Implementation and Evaluation of Distributed Geographical Routing

Part 3: Network DeploymentInternational audienceGeocast has the potential to facilitate message delivering for geographically scoped information in many future scenarios such as vehicular networking and crisis control. An efficient geographic routing protocol is needed to enable Internet-wide geocast on the network level. In this paper we evaluate an implementation of a path based geographic routing protocol. We specifically look at the behavior and performance of this protocol during network convergence. We show that our implementation constructs forwarding trees that are close to a shortest path tree in link cost. We also show that our algorithm converges relatively quickly in case the network changes

An Efficient Geographical Addressing Scheme for the Internet

Part 2: Middleboxes and AddressingInternational audienceGeocast is a scheme which allows packets to be sent to a destination area instead of an address. This allows the addressing of any device in a specific region without further knowledge. In this paper we present an addressing mechanism that allows efficient referral to areas of arbitrary size. The binary representation of our addressing mechanism fits in an IPv6 address and can be used for route lookup with simple exclusive-or operations. We show that our addressing mechanism can be used to address areas accurately enough to be used as a mechanism to route packets close to their destination

Design & analysis of a distributed routing algorithm towards Internet-wide geocast

Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. This forwarding method is valuable in situations where any number of nodes inside a geographic area need to be reached, such as vehicular networking scenarios. To facilitate large scale geocast, a wired network geographic routing algorithm is needed that can route packets efficiently towards a destination area. Our goal is to design an algorithm that can deliver shortest path tree like geographic forwarding while relying purely on distributed data without central knowledge. In this paper we present and implement two algorithms for geographic routing. One algorithm is based purely on distance-vector data. Another, more complicated algorithm is based on path data. We show that our purely distance-vector-based algorithm can come close to the number of links used by a shortest path tree when a small number of routers are present in the destination area. We also show that our path-based algorithm can come close to the link usage of a shortest path tree in almost all geocast situations. We also show that the algorithms converge relatively quickly following link drops

A Distributed Routing Algorithm for Internet-wide Geocast

Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations

Machine Learning for Cooperative Driving in a Multi-Lane Highway Environment

Most of the research in automated driving currently involves using the on-board sensors on the vehicle to collect information regarding surrounding vehicles to maneuver around them. In this paper we discuss how information communicated through vehicular networking can be used for controlling an autonomous vehicle in a multi-lane highway environment. A driving algorithm is designed using deep Q learning, a type of reinforcement learning. In order to train and test driving algorithms, we deploy a simulated traffic system, using SUMO (Simulation of Urban Mobility). The performance of the driving algorithm is tested for perfect knowledge regarding surrounding vehicles. Furthermore, the impact of limited communication range and random packet loss is investigated. Currently the performance of the driving algorithm is far from ideal with the collision ratios being quite high. We propose directions for additional research to improve the performance of the algorithm

Improving Spatial Indexing and Searching for Location-Based DNS Queries

Part 5: Network ProtocolsInternational audienceIn the domain of vehicular networking, it is of significant relevance to be able to address vehicles based on their geographical position rather than the network address. The integration of geocasting (i.e. the dissemination of messages to all nodes within a specific geographical region) into the existing addressing scheme of the Internet is challenging, due to its logical hierarchy. One solution to Internet-based geographical addressing is eDNS, an extension to the DNS protocol. It adds support for querying geographical locations as a supplement to logical domain names. In this work, eDNS is extended with nearest neighbor resolution support, and further, a prototype server is developed that uses bounding box propagation between servers for delegation. Our experiments confirm that distributing location records over multiple servers improves performance

Infrastructure Support for Contention-Based Forwarding

Geocast is an important forwarding method for vehicular networks. One standard of vehicular communication is ETSI ITS-G5 GeoNetworking. One of the forwarding methods for geocast in this standard is Contention Based Forwarding (CBF). CBF is dependent on a favourable vehicle distribution to forward messages over multiple hops. A method to extend the effective range of vehicles is to use road side infrastructure to help forward messages. We propose a slightly modified CBF algorithm for road side infrastructure to enable infrastructure assisted forwarding for geocast messages, without modifying the CBF algorithm in the vehicles. In this paper we show that such a relatively small modification can significantly increase delivery rates while also reducing wireless load and delivery delays